Initialization Halting Concepts and Their Basic Properties of SCMFSA
نویسندگان
چکیده
Up to now, many properties of macro instructions of SCMFSA are described by the parahalting concepts. However, many practical programs are not always halting while they are halting for initialization states. For this reason, we propose initialization halting concepts. That a program is initialization halting (called ”InitHalting” for short) means it is halting for initialization states.In order to make the halting proof of more complicated programs easy, we present ”InitHalting” basic properties of the compositions of the macro instructions, ifMacro (conditional branch macro instructions) and Times-Macro (for-loop macro instructions) etc.
منابع مشابه
On the Composition of Non-parahalting Macro Instructions
An attempt to use the Times macro, [2], was the origin of writing this article. First, the semantics of the macro composition as developed in [23, 3, 4] is extended to the case of macro instructions which are not always halting. Next, several functors extending the memory handling for SCMFSA, [18], are defined; they are convenient when writing more complicated programs. After this preparatory w...
متن کاملInsert Sort on SCM FSA 1
This article describes the insert sorting algorithm using macro instructions such as if-Macro (conditional branch macro instructions), for-loop macro instructions and While-Macro instructions etc. From the viewpoint of initialization, we generalize the halting and computing problem of the While-Macro. Generally speaking, it is difficult to judge whether the While-Macro is halting or not by way ...
متن کاملExplaining the theoretical framework and the components of research comprehensive approach and designing its general elements in the school curriculum
Abstract: An effective research requires the initialization of knowledge, positive affect and research action in the researcher as well as the initialization of research comprehensive attitude. The present study was conducted using descriptive-analytical method based on analyzing the concepts and re-processing the results of previous research. Based on this, theoretical and research background ...
متن کاملOn the Instructions of SCM FSA 1 Artur
The articles [18], [10], [11], [12], [22], [5], [14], [3], [6], [20], [7], [8], [9], [4], [19], [1], [2], [23], [24], [17], [16], [13], [21], and [15] provide the terminology and notation for this paper. For simplicity, we use the following convention: a, b are integer locations, f is a finite sequence location, i1, i2, i3 are instruction-locations of SCMFSA, T is an instruction type of SCMFSA,...
متن کاملBubble Sort on SCMFSA
We present the bubble sorting algorithm using macro instructions such as the if-Macro (conditional branch macro instructions) and the TimesMacro (for-loop macro instructions) etc. The correctness proof of the program should include the proof of autonomic, halting and the correctness of the program result. In the three terms, we justify rigorously the correctness of the bubble sorting algorithm....
متن کامل